A MULTI-COMMODITY FLOW NETWORK DESIGN PROBLEMFOULDS LR.1981; TRANSP. RES., PART B: METHODOL.; ISSN 0191-2615; GBR; DA. 1981; VOL. 15; NO 4; PP. 273-283; BIBL. 20 REF.Article

ENUMERATION OF BINARY PHYLOGENETIC TREESFOULDS LR; ROBINSON RW.1981; LECT. NOTES MATH.; ISSN 0075-8434; DEU; DA. 1981; NO 884; PP. 187-202; BIBL. 10 REF.Conference Paper

COMPARISON OF PHYLOGENETIC TREESROBINSON DF; FOULDS LR.1981; MATH. BIOSCI.; ISSN 0025-5564; USA; DA. 1981; VOL. 53; NO 1-2; PP. 131-147; BIBL. 15 REF.Article

COMPARISON OF WEIGHTED LABELLED TREESROBINSON DF; FOULDS LR.1979; LECTURE NOTES MATH.; DEU; DA. 1979; NO 748; PP. 119-126; BIBL. 5 REF.Conference Paper

A GRAPH THEORETIC APPROACH TO THE DEVELOPMENT OF MINIMAL PHYLOGENETIC TREESFOULDS LR; HENDY MD; PENNY D et al.1979; J. MOLEC. EVOL.; DEU; DA. 1979; VOL. 13; NO 2; PP. 127-149; BIBL. 1 P.Article

TECHNIQUES FOR THE VERIFICATION OF MINIMAL PHYLOGENETIC TREES ILLUSTRATED WITH TEN MAMMALIAN HAEMOGLOBIN SEQUENCESPENNY D; HENDY MD; FOULDS LR et al.1980; BIOCHEM. J.; GBR; DA. 1980; VOL. 187; NO 1; PP. 65-74; BIBL. 11 REF.Article

A GENERAL APPROACH TO PROVING THE MINIMALITY OF PHYLOGENETIC TREES ILLUSTRATED BY AN EXAMPLE WITH A SET OF 23 VERTEBRATESFOULDS LR; PENNY D; HENDY MD et al.1979; J. MOLEC. EVOL.; DEU; DA. 1979; VOL. 13; NO 2; PP. 151-166; BIBL. 18 REF.Article

NETWORK LAYOUT PROCEDURE FOR PRINTED-CIRCUIT DESIGN.FOULDS LR; PERERA SM; ROBINSON DF et al.1978; COMPUTER AIDED DESIGN; GBR; DA. 1978; VOL. 10; NO 3; PP. 177-180; BIBL. 3 REF.Article